AN-501 Appl Note
ثبت نشده
چکیده
Aperture Uncertainty One of the key concerns when performing IF sampling is that of aperture jitter or aperture uncertainty. The terms aperture jitter and aperture uncertainty are frequently interchanged in text. In this application, they have the same meaning. Aperture uncertainty is the sample-tosample variation in the encode process. Aperture uncertainty has three residual effects: the first is an increase in system noise, the second is an uncertainty in the actual phase of the sampled signal itself and third is intersymbol interference. To achieve required noise performance, aperture uncertainty of less than 1 ps is required when IF sampling. In terms of phase accuracy and intersymbol interference, the effects of aperture uncertainty are small. In a worst case scenario of 1 ps rms at an IF of 250 MHz, the phase uncertainty of error is 0.09 degrees rms. This is quite acceptable even for a demanding specification such as GSM. The focus of this analysis will therefore be on overall noise contribution due to aperture uncertainty.
منابع مشابه
A Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei
In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...
متن کاملA note on the remainders of rectifiable spaces
In this paper, we mainly investigate how the generalized metrizability properties of the remainders affect the metrizability of rectifiable spaces, and how the character of the remainders affects the character and the size of a rectifiable space. Some results in [A. V. Arhangel'skii and J. Van Mill, On topological groups with a first-countable remainder, Topology Proc. 42 (2013...
متن کاملA note on inequalities for Tsallis relative operator entropy
In this short note, we present some inequalities for relative operator entropy which are generalizations of some results obtained by Zou [Operator inequalities associated with Tsallis relative operator entropy, {em Math. Inequal. Appl.} {18} (2015), no. 2, 401--406]. Meanwhile, we also show some new lower and upper bounds for relative operator entropy and Tsallis relative o...
متن کاملA note on the complexity of longest path problems related to graph coloring
In this note, we show that some problems related to the length of the longest simple path from a given vertex in a graph are NP-complete. We also discuss an extension to the graph coloring problem. @ 2004 Elsevier Ltd. All rights reserved. Keywords-Longest path, Graph coloring, Complexity.
متن کامل